Global Induction of Oblique Decision Trees: An Evolutionary Approach
نویسندگان
چکیده
A new evolutionary algorithm for induction of oblique decision trees is proposed. In contrast to the classical top-down approach, it searches for the whole tree at the moment. Specialized genetic operators are developed, which enable modifying both the tree structure and the splitting hyper-planes in non-terminal nodes. The problem of over-fitting can be avoided thanks to suitably defined fitness function. Experimental results on both synthetical and real-life data are presented and compared with obtained by the state-of-the-art decision tree systems.
منابع مشابه
Global Induction of Decision Trees: From Parallel Implementation to Distributed Evolution
In most of data mining systems decision trees are induced in a top-down manner. This greedy method is fast but can fail for certain classification problems. As an alternative a global approach based on evolutionary algorithms (EAs) can be applied. We developed Global Decision Tree (GDT) system, which learns a tree structure and tests in one run of the EA. Specialized genetic operators are used,...
متن کاملAn Evolutionary Algorithm for Oblique Decision Tree Induction
In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to search for a splitting hyperplane. The feature selection is embedded into the algorithm, which allows to eliminate redundant and noisy features at each node. The experimental evaluation of the proposed approach is presente...
متن کاملGlobal Induction of Oblique Model Trees: An Evolutionary Approach
In this paper we propose a new evolutionary algorithm for global induction of oblique model trees that associates leaves with multiple linear regression models. In contrast to the typical top-down approaches it globally searches for the best tree structure, splitting hyperplanes in internal nodes and models in the leaves. The general structure of proposed solution follows a typical framework of...
متن کاملEvolutionary Induction of Mixed Decision Trees1
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, ranging from a typical inequality test up to an oblique test based on a splitting hyper-plane. In contrast to classical top-down methods, the proposed system searches for an optimal tree in a global manner, that is it learns...
متن کاملEvolution of Decision Trees
This paper addresses the issue of the induction of orthogonal, oblique and multivariate decision trees. Algorithms proposed by other researchers use heuristic, usually based on the information gain concept, to induce decision trees greedily. These algorithms are often tailored for a given tree type (e.g orthogonal), not being able to induce other types of decision trees. Our work presents an al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005